Trees and extensive forms

Trees and extensive forms

This paper addresses the question of what it takes to obtain a well-defined extensive form game. Without relying on simplifying finiteness or discreteness assumptions, we characterize the class of game trees for which all pure strategy combinations induce unique outcomes. The generality of the set-up covers “exotic” cases, like stochastic games or decision problems in continuous time (different...

Comment on "Trees and extensive forms" [J. Econ. Theory 143 (1) (2008) 216-250]

We correct the formulation of one of the properties in [C AI6s-Ferrer, K. Ritzberger, Trees and extensive forms, 1. Econ. Theory 143 (1) (2008) 216-250]. The correction concerns property (EDP.iii') in Section 6.2 (p. 239) and affects results in that final section only. This propcrty, which determines when an Extensive Decision Problem (EDP) is called an Extensive Form (EF), is misstated in the ...

Games in Extensive and Strategic Forms

Mining Frequent Rooted Trees and Free Trees Using Canonical Forms

Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. In this paper, we present HybridTreeMiner, a computationally efficient algorithm that discovers all frequently occurring subtrees in a database of rooted unordered trees. The algorithm mines frequent subtrees by traversing an enumeration tree that syst...

An Extensive Survey of Graceful Trees

A tree with n vertices is called graceful if there exists a labeling of its vertices with the numbers from 1 to n such that the set of absolute values of the differences of the numbers assigned to the ends of each edge is the set {1, 2, .., n− 1}. The problem of whether or not all trees are graceful is still open. In this paper, we give an extensive survey of most of the results related to this...